- permutation transform
- преобразование подстановкой
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
permutation transform
Смотреть что такое "permutation transform" в других словарях:
permutation — mutation, *change, vicissitude, alternation Analogous words: moving or move, shifting or shift, removing or remove (see MOVE): transformation, conversion, metamorphosis (see under TRANSFORM) … New Dictionary of Synonyms
Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… … Wikipedia
Boustrophedon transform — In mathematics, the boustrophedon transform is a procedure which maps one sequence to another. The transformed sequence is computed by filling a triangle in boustrophedon (zig zag) manner.DefinitionGiven a sequence (a 0, a 1, a 2, ldots), the… … Wikipedia
Bit-reversal permutation — Product of Gray code permutation and bit reversal permutation (4 bit) (The result permutes a natural ordered into a sequence ordered Hadamard matrix.) In applied mathematics, a bit reversal permutation is a permutation of a sequence with… … Wikipedia
Hadamard transform — The Hadamard transform (also known as the Walsh Hadamard transform, Hadamard Rademacher Walsh transform, Walsh transform, or Walsh Fourier transform) is an example of a generalized class of Fourier transforms. It is named for the French… … Wikipedia
Modified discrete cosine transform — The modified discrete cosine transform (MDCT) is a Fourier related transform based on the type IV discrete cosine transform (DCT IV), with the additional property of being lapped: it is designed to be performed on consecutive blocks of a larger… … Wikipedia
Substitution-permutation network — In cryptography, an SP network, or substitution permutation network (SPN), is a series of linked mathematical operations used in block cipher algorithms such as AES.These networks consist of S boxes and P boxes that transform blocks of input bits … Wikipedia
Alternating permutation — In combinatorial mathematics, an alternating permutation of the set {1, 2, 3, ..., n } is an arrangement of those numbers into an order c 1, ..., c n such that no element c i is between c i − 1 and c i + 1 for any value of i and c 1 lt; c 2.Let A … Wikipedia
Key-to-Address Transform Techniques — In der Informatik bezeichnet man eine spezielle Indexstruktur als Hashtabelle (englisch hash table oder hash map) bzw. Streuwerttabelle. Hashtabellen eignen sich vor allem dazu, Datenelemente in einer großen Datenmenge aufzufinden. Hashtabellen… … Deutsch Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
